A theory of transfinite convergence

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The defining core of a theory of infinitary term rewriting is its notion of convergence for transfinite reductions: which transfinite reductions

We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We consider both a weak and a strong notion of convergence and show that the metric model of convergence coincides with the partial order model restricted to total terms. Hence, partial order convergence constitutes a cons...

متن کامل

Transfinite Ordinals in Recursive Number Theory

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...

متن کامل

Transfinite Methods in Metric Fixed-point Theory

This is a brief survey of the use of transfinite induction in metric fixed-point theory. Among the results discussed in some detail is the author’s 1989 result on directionally nonexpansive mappings (which is somewhat sharpened), a result of Kulesza and Lim giving conditions when countable compactness implies compactness, a recent inwardness result for contractions due to Lim, and a recent exte...

متن کامل

Transfinite Constructions in Classical Type Theory

We study a transfinite construction we call tower construction in classical type theory. The construction is inductive and applies to partially ordered types. It yields the set of all points reachable from a starting point with an increasing successor function and a family of admissible suprema. Based on the construction, we obtain type-theoretic versions of the theorems of Zermelo (well-orderi...

متن کامل

Continuity, proof systems and the theory of transfinite computations

The purpose of this paper is to show how the concept of transfinite computations relative to certain functionals of type 3 can be used to construct topologies and transfinite proof systems adding extra structure to some sets transfinitly definable over the continuum. Our aim is to initiate a fine-structure analysis of sets of the form Lκ(HC). We will motivate this below. Before doing so, let us...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1949

ISSN: 0002-9947

DOI: 10.1090/s0002-9947-1949-0030742-6